package demo.benchmarks.Airy.Sign.Eq;
public class newV{

public static int snippet(int x,int b) {
    int NUMPRIMES = 8;
    int[] primes = {2, 3, 5, 7, 11, 13, 17, 19};
    x=20;
    b=1;
    if (b == 0) {
        return 0;
    }
    else{
        for (int i = 0; i < NUMPRIMES; i++) {
            int mod = x % primes[i];
            if (mod == 0) {
                return x == primes[i] ? 1 : 0;
            }
        }
    }
    return 1;
}

}